Syntactic view of sigma-tau generation of permutations
نویسندگان
چکیده
We give a syntactic view of the Sawada-Williams (σ,τ)-generation permutations. The corresponding sequence Seqn στ-operations length n!−1 is shown to have compact description size Θ(n2) in terms straight-line programs. Using description, we design almost linear time ranking and unranking algorithms.
منابع مشابه
the impact of skopos on syntactic features of the target text
the present study is an experimental case study which investigates the impacts, if any, of skopos on syntactic features of the target text. two test groups each consisting of 10 ma students translated a set of sentences selected from advertising texts in the operative and informative mode. the resulting target texts were then statistically analyzed in terms of the number of words, phrases, si...
15 صفحه اولSome commutativity theorems for $*$-prime rings with $(sigma,tau)$-derivation
Let $R$ be a $*$-prime ring with center $Z(R)$, $d$ a non-zero $(sigma,tau)$-derivation of $R$ with associated automorphisms $sigma$ and $tau$ of $R$, such that $sigma$, $tau$ and $d$ commute with $'*'$. Suppose that $U$ is an ideal of $R$ such that $U^*=U$, and $C_{sigma,tau}={cin R~|~csigma(x)=tau(x)c~mbox{for~all}~xin R}.$ In the present paper, it is shown that if charac...
متن کاملLie ternary $(sigma,tau,xi)$--derivations on Banach ternary algebras
Let $A$ be a Banach ternary algebra over a scalar field $Bbb R$ or $Bbb C$ and $X$ be a ternary Banach $A$--module. Let $sigma,tau$ and $xi$ be linear mappings on $A$, a linear mapping $D:(A,[~]_A)to (X,[~]_X)$ is called a Lie ternary $(sigma,tau,xi)$--derivation, if $$D([a,b,c])=[[D(a)bc]_X]_{(sigma,tau,xi)}-[[D(c)ba]_X]_{(sigma,tau,xi)}$$ for all $a,b,cin A$, where $[abc]_{(sigma,tau,xi)}=ata...
متن کاملCorrigendum to "On $(sigma, tau)$-module extension Banach algebras"
In this corrigendum, we give a correction of one result in reference [1].
متن کاملGeneration of Permutations by Transposition
(3) All calculations are mod m¡ so that the digits of the mixed radix representation of [x]u can be obtained using only calculations mod m¡. (4) The value x x(a) can be obtained from x x(a) = x x(a_1) 4x(°_1) x " so that the modular number x need not be remembered during the whole process. (5) The matrices (do) and (x.j) are computed preliminary to the iteration procedure and are not part of it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.06.008